On finding complex roots of polynomials using the Routh array
نویسندگان
چکیده
We present a method, based on the Routh stability criterion, for transforming the task of finding the complex roots of a polynomial of even degree n with real coefficients to that of: (a) finding their real parts as the n/2 real roots of a polynomial of degree n(n−1)/2; (b) for each real part, calculating the corresponding imaginary part as a square root. We illustrate the method for polynomials of degree 4 and indicate its application to polynomials of any even degree.
منابع مشابه
Complex roots via real roots and square roots using Routh’s stability criterion
We present a method, based on the Routh stability criterion, for finding the complex roots of polynomials with real coefficients. As in Gauss’s 1815 proof of the Fundamental Theorem of Algebra, we reduce the problem to that of finding real roots and square roots of certain associated polynomials. Unlike Gauss’s proof, our method generates these associated polynomials in an algorithmic way.
متن کاملSome Remarks on the -stability for Families of Polynomials
Using Brouwer degree, we prove a more general version of the zero exclusion principle for families of polynomials and apply it to obtain very simple proofs of extensions of recent results on the Routh-Hurwitz and Schur-Cohn stability of families of polynomials. 1. Introduction It is well know that the problem of the stability of a linear diierence or differential system with constant coeecients...
متن کاملOn Classifications of Random Polynomials
Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...
متن کاملA New Formulation of the Theorems of Hurwitz, Routh and Sturm
It is shown that the Hurwitz determinants associated with a real polynomial of degree n can be obtained from minors of matrices having orders n/2 or (« —1)/2 according as n is even or odd. The method used is based on forming companion matrices of appropriate polynomials, and is extended to calculation of Routh arrays, Sturm sequences and to complex polynomials, thus providing a new formulation ...
متن کاملComplex-coefficient Polynomial Roots by a Stability Criterion
Computation of polynomial roots is a problem that arises in various domains of science and engineering, and has thus received much attention in years, with marked recent progress. This paper introduces a new numerical algorithm for computing the roots of a complex-coefficient polynomial of degree n. The method is based on bracketing, in the spirit of Lehmer-Schur [1], but uses a robust stabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005